A Fresh Variational-Analysis Look at the Positive Semidefinite Matrices World
نویسندگان
چکیده
Engineering sciences and applications of mathematics show unambiguously that positive semidefiniteness of matrices is the most important generalization of non-negative real numbers. This notion of non-negativity for matrices has been well-studied in the literature; it has been the subject of review papers and entire chapters of books. This paper reviews some of the nice, useful properties of positive (semi)definite matrices, and insists in particular on (i) characterizations of positive (semi)definiteness and (ii) the geometrical properties of the set of positive semidefinite matrices. Some properties that turn out to be less well-known have here a special treatment. The use of these properties in optimization, as well as various references to applications, are spread all the way through. The “raison d’être” of this paper is essentially pedagogical; it adopts the viewpoint of variational analysis, shedding new light on the topic. Important, fruitful, and subtle, the positive semidefinite world is a good place to start with this domain of applied mathematics.
منابع مشابه
Singular value inequalities for positive semidefinite matrices
In this note, we obtain some singular values inequalities for positive semidefinite matrices by using block matrix technique. Our results are similar to some inequalities shown by Bhatia and Kittaneh in [Linear Algebra Appl. 308 (2000) 203-211] and [Linear Algebra Appl. 428 (2008) 2177-2191].
متن کاملVariational analysis of non-Lipschitz spectral functions
We consider spectral functions f ◦ λ, where f is any permutation-invariant mapping from Cn to R, and λ is the eigenvalue map from the set of n × n complex matrices to Cn , ordering the eigenvalues lexicographically. For example, if f is the function “maximum real part”, then f ◦ λ is the spectral abscissa, while if f is “maximum modulus”, then f ◦ λ is the spectral radius. Both these spectral f...
متن کاملA fresh CP look at mixed-binary QPs: new formulations and relaxations
Triggered by Burer’s seminal characterization from 2009, many copositive (CP) reformulations of mixed-binary QPs have been discussed by now. Most of them can be used as proper relaxations, if the intractable co(mpletely )positive cones are replaced by tractable approximations. While the widely used approximation hierarchies have the disadvantage to use positive-semidefinite (psd) matrices of or...
متن کاملEigenvalues and nonsmooth optimization
Variational analysis concerns the geometry and calculus of nonsmooth sets and functions, often viewed from an optimization perspective. Over several decades, variational analysis has matured into a powerful and elegant theory. One rich source of concrete examples involves the eigenvalues of symmetric and nonsymmetric matrices, sometimes deriving from dynamical or feedback control questions. Thi...
متن کاملCopositive and semidefinite relaxations of the quadratic assignment problem
Semidefinite relaxations of the quadratic assignment problem (QAP ) have recently turned out to provide good approximations to the optimal value of QAP . We take a systematic look at various conic relaxations of QAP . We first show that QAP can equivalently be formulated as a linear program over the cone of completely positive matrices. Since it is hard to optimize over this cone, we also look ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Optimization Theory and Applications
دوره 153 شماره
صفحات -
تاریخ انتشار 2012